Cato Wadel, Det skjulte arbeid, Oslo: Universitetsforlaget, 1984, 120,00 Nkr.
نویسندگان
چکیده
منابع مشابه
Taxation Cato Encyclopedia.PDF
Above the entrance to the headquarters of the Internal Revenue Service on Constitution Avenue is chiseled the quotation from Oliver Wendell Holmes: “Taxation is the price we pay for civilization.” It is easy enough to see why state officials would want to put that quotation on display, for it counsels people to be pleased with the taxes they pay. It’s not so easy, though, to determine the accur...
متن کاملCATO: The Clone Alignment Tool
High-throughput cloning efforts produce large numbers of sequences that need to be aligned, edited, compared with reference sequences, and organized as files and selected clones. Different pieces of software are typically required to perform each of these tasks. We have designed a single piece of software, CATO, the Clone Alignment Tool, that allows a user to align, evaluate, edit, and select c...
متن کاملThe Norwegian type-anaphor det
This paper gives a description of the Norwegian type anaphor det ('that') and proposes a formal representation of it in the HPSG framework. This identity-of-sense anaphor is interpreted as referring to a (new) set of entities of the same type as its antecedent. Its antecedent has to be either indefinite or a definite NP that is likely to introduce a brand new discourse referent. Whereas the typ...
متن کاملCATO - A Lightweight Ontology Alignment Tool
Ontologies are becoming increasingly common in the World Wide Web as the building block for a future Semantic Web. In this Web, ontologies will be responsible for making the semantics of pages and applications explicit, thus allowing electronic agents to process and integrate resources automatically. With the widespread, distributed use of ontologies, different parties will inevitably develop o...
متن کاملDet-extremal cubic bipartite graphs
Let G be a connected k–regular bipartite graph with bipartition V (G) = X ∪Y and adjacency matrix A. We say G is det–extremal if per(A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det–extremal 3–connected cubic bipartite graphs. We extend McCuaig’s result by determining the structure of det–extremal cubic bipartite graphs of conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Politica
سال: 1985
ISSN: 2246-042X,0105-0710
DOI: 10.7146/politica.v17i1.68687